Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time
نویسندگان
چکیده
منابع مشابه
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. In particular, lots of work has been devoted to jobs with simple linear deterioration. The processing time pj of job Jj is a simple linear function of its start time sj , precisely, pj = bjsj , where bj is the...
متن کاملUnrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
We study the problem of unrelated parallel-machine scheduling with deteriorating maintenance activities. Each machine has at most one maintenance activity, which can be performed at any time throughout the planning horizon. The length of the maintenance activity increases linearly with its starting time. The objective is to minimize the total completion time or the total machine load. We show t...
متن کاملScheduling with Rejection to Minimize the Total Weighted Completion Time∗
In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted completion time with the constraint of total penalties on identical parallel machines, where the number of...
متن کاملMinimizing the total completion time in single-machine scheduling with step-deteriorating jobs
In this paper, we study a scheduling problem of minimizing the total completion time on a single machine where the processing time of a job is a step function of its starting time and a due date that is common to all jobs. This problem has been shown to be NP-hard in the literature. To derive optimal solutions from a practical aspect, we develop a lower bound and two elimination rules to design...
متن کاملSingle-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
We consider the problem of scheduling multi-operation jobs on a singe machine to minimize the total completion time. Each job consists of several operations that belong to different families. In a schedule each family of job operations may be processed as batches with each batch incurring a set-up time. A job is completed when all of its operations have been processed. We first show that the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2013
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-013-0019-6